A Comparison of Large Scale Mixed Complementarity Problem Solvers
نویسندگان
چکیده
This paper provides a means for comparing various computer codes for solving large scale mixed complementarity problems. We discuss inadequacies in how solvers are currently compared, and present a testing environment that addresses these inadequacies. This testing environment consists of a library of test problems, along with GAMS and MATLAB interfaces that allow these problems to be easily accessed. The environment is intended for use as a tool by other researchers to better understand both their algorithms and their implementations, and to direct research toward problem classes that are currently the most challenging. As an initial benchmark, eight diierent algorithm implementations for large scale mixed complementarity problems are brieey described and tested with default parameter settings using the new testing environment.
منابع مشابه
An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملFlexible complementarity solvers for large-scale applications
Discretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set methods that solve only one linear system of equations per iteration. The linear solver, preconditioner, and matrix structures can be chosen by the user for a pa...
متن کاملبرنامهریزی درسی در دانشگاه به کمک مدلسازی دو مرحلهای برنامهریزی ریاضی
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
متن کاملComplementarity Problems in Engineering Mechanics: Models and Solution
A large class of problems in engineering mechanics involves a so-called “complementarity” relationship representing the orthogonality of two sign-constrained vectors. Typical instances are plasticity laws and contact-like conditions. For state problems, the formulation leads to a mixed complementarity problem (MCP) whereas in synthesis (e.g. minimum weight design) or identification problems, a ...
متن کاملA computational study of the use of an optimization-based method for simulating large multibody systems
The present work aims at comparing the performance of several quadratic programming (QP) solvers for simulating large-scale frictional rigid-body systems. Traditional time-stepping schemes for simulation of multibody systems are formulated as linear complementarity problems (LCPs) with copositive matrices. Such LCPs are generally solved by means of Lemketype algorithms and solvers such as the P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 7 شماره
صفحات -
تاریخ انتشار 1997